Location-Based Instant Search

نویسندگان

  • Shengyue Ji
  • Chen Li
چکیده

Location-based keyword search has become an important part of our daily life. Such a query asks for records satisfying both a spatial condition and a keyword condition. State-of-the-art techniques extend a spatial tree structure by adding keyword information. In this paper we study location-based instant search, where a system searches based on a partial query a user has typed in. We first develop a new indexing technique, called filtering-effective hybrid index (FEH), that judiciously uses two types of keyword filters based on their selectiveness to do powerful pruning. Then, we develop indexing and search techniques that store prefix information on the FEH index and efficiently answer partial queries. Our experiments show a high efficiency and scalability of these techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-time #SemanticWeb in <= 140 chars

Instant publication, along with the prospect of widespread geotagging in microblog posts, presents new opportunities for real-time and location-based services. Much as these services are changing the nature of search on the World Wide Web, so the Semantic Web is certain to be both challenged and enhanced by real-time content. This paper introduces a semantic data aggregator which brings togethe...

متن کامل

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...

متن کامل

A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem

The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...

متن کامل

Discrete search with multiple sensors

A stationary object is hidden in location i, i 1⁄4 1; 2; ;K, with probability pi. There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches, so that a search of location i finds the object, if it is in that location, with probability ai. After...

متن کامل

Application of Hazard Based Model for Housing Location Based on Travel Distance to Work

Residential location choice modeling is one of the areas in transportation planning that attempts to examine households location search behavior incorporating their trade-offs between housing quality, prices or rents, distance to work and other key factors. This brings up the need to come up with methods to logically allocate credible choice alternatives for individuals.This article attempts to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011